The Minimum Satisfiability Problem
نویسندگان
چکیده
This paper shows that a minimization version of satisfiability is strongly NP-hard, even if each clause contains no more than two literals and/or each clause contains at most one unnegated variable. The worst-case and average-case performances of greedy and probabilistic greedy heuristics for the problem are examined, and tight upper bounds on the performance ratio in each case are developed. Key words, minimum satisfiability, satisfiability, heuristics, probabilistic algorithms, average performance, Horn formulae AMS subject classification. 68Q25
منابع مشابه
Minimum Satisfiability and Its Applications
We define solving techniques for theMinimum Satisfiability Problem (MinSAT), propose an efficient branch-and-bound algorithm to solve the Weighted Partial MinSAT problem, and report on an empirical evaluation of the algorithm onMin-3SAT,MaxClique, and combinatorial auction problems. Techniques solving MinSAT are substantially different from those for the Maximum Satisfiability Problem (MaxSAT)....
متن کاملThe Minimum k-Cover Problem
distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. Abstract We consider the problem of determining the minimum cardinality collection of substrings, each of given length k ≥ 2, that " cover " a given string x of length n. We describe an approach to solve this prob...
متن کاملIntegrating Mixed-Integer Optimisation and Satisfiability Modulo Theories: Application to Scheduling
One way to address multi-scale optimisation problems is by integrating logic and optimisation. For example, a scheduling problem may have two levels: (i) assigning orders to machines and (ii) sequencing orders on each machine. In a minumum cost model, assigning orders to machines is a mixed-integer optimisation problem, sequencing orders is a constraint satisfaction problem. The entire problem ...
متن کاملOn Approximation Algorithms for the Minimum Satisfiability Problem
We consider the following minimum satisfiability (MINSAT) problem: Given a CNF formula, find a truth assignment to the variables that minimizes the number of satisfied clauses. This problem was shown to be NP-complete by R. Kohli, R. Krishnamurti and P. Mirchandani ( 1994). They also presented an approximation algorithm whose performance guarantee is equal to the maximum number of literals in a...
متن کاملAnt Colony Optimization approach for Solving FPGA routing with minimum Channel Width
In this paper ANT colony optimization algorithm has been proposed to solve FPGA routing in FPGA design architecture with minimum umbers of tracks per channel. In our method geometric FPGA routing task is transformed into a Boolean satisfiability (SAT) equation with the property that any assignment of input variables that satisfies the equation specifies a valid route. The satisfiability equatio...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- SIAM J. Discrete Math.
دوره 7 شماره
صفحات -
تاریخ انتشار 1994